"outer totalistic" meaning in All languages combined

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "outer totalistic (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Cellular automata",
          "orig": "en:Cellular automata",
          "parents": [
            "Mathematics",
            "Theory of computing",
            "Formal sciences",
            "Computer science",
            "Sciences",
            "Computing",
            "All topics",
            "Technology",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2003 January 18, Frank Buss, “Searching detailed description of Codd's automaton”, in comp.theory.cell-automata (Usenet)",
          "text": "Why it is important, to design totalistic or outer totalistic rules?",
          "type": "quotation"
        },
        {
          "ref": "2003 December 13, Ilmari Karonen, “'TimeWarp' CA rule -- anyone recognize this one?”, in comp.theory.cell-automata (Usenet)",
          "text": "It's the second-order reversible outer totalistic rule b1234/s0123R on the von Neumann neighborhood.",
          "type": "quotation"
        },
        {
          "ref": "2007 August 28, Bob, “Lambda value of (outer-)totalistic code”, in comp.theory.cell-automata (Usenet)",
          "text": "Hello, How to compute lambda value for (outer-)totalistic rule? Is it the same way like computing for elementary?",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Having the state of each cell represented by a number, and the value of a cell dependent only on its current value along with the sum of the values of nearby cells."
      ],
      "id": "en-outer_totalistic-en-adj-odZW7GV3",
      "links": [
        [
          "cellular automata",
          "cellular automata"
        ],
        [
          "state",
          "state"
        ],
        [
          "cell",
          "cell"
        ],
        [
          "number",
          "number"
        ],
        [
          "value",
          "value"
        ],
        [
          "sum",
          "sum"
        ]
      ],
      "raw_glosses": [
        "(cellular automata) Having the state of each cell represented by a number, and the value of a cell dependent only on its current value along with the sum of the values of nearby cells."
      ],
      "synonyms": [
        {
          "word": "semitotalistic"
        },
        {
          "word": "outer-totalistic"
        }
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "cellular-automata",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "outer totalistic"
}

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "outer totalistic (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English terms with quotations",
        "English uncomparable adjectives",
        "en:Cellular automata"
      ],
      "examples": [
        {
          "ref": "2003 January 18, Frank Buss, “Searching detailed description of Codd's automaton”, in comp.theory.cell-automata (Usenet)",
          "text": "Why it is important, to design totalistic or outer totalistic rules?",
          "type": "quotation"
        },
        {
          "ref": "2003 December 13, Ilmari Karonen, “'TimeWarp' CA rule -- anyone recognize this one?”, in comp.theory.cell-automata (Usenet)",
          "text": "It's the second-order reversible outer totalistic rule b1234/s0123R on the von Neumann neighborhood.",
          "type": "quotation"
        },
        {
          "ref": "2007 August 28, Bob, “Lambda value of (outer-)totalistic code”, in comp.theory.cell-automata (Usenet)",
          "text": "Hello, How to compute lambda value for (outer-)totalistic rule? Is it the same way like computing for elementary?",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Having the state of each cell represented by a number, and the value of a cell dependent only on its current value along with the sum of the values of nearby cells."
      ],
      "links": [
        [
          "cellular automata",
          "cellular automata"
        ],
        [
          "state",
          "state"
        ],
        [
          "cell",
          "cell"
        ],
        [
          "number",
          "number"
        ],
        [
          "value",
          "value"
        ],
        [
          "sum",
          "sum"
        ]
      ],
      "raw_glosses": [
        "(cellular automata) Having the state of each cell represented by a number, and the value of a cell dependent only on its current value along with the sum of the values of nearby cells."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "cellular-automata",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "semitotalistic"
    },
    {
      "word": "outer-totalistic"
    }
  ],
  "word": "outer totalistic"
}